Weighted network graph for interpersonal communication with temporal regularity
نویسندگان
چکیده
منابع مشابه
Investigating the functional communication network in patients with knee osteoarthritis using graph-based statistical models
Introduction: Osteoarthritis of the knee is the most prevalent type of arthritis that causes persistent pain and reduces the quality of life. However, no treatment alleviates symptoms or stops the disease from progressing. Functional magnetic resonance imaging (fMRI) studies can provide information on neural mechanisms of pain by assessing correlation patterns among the different regions of the...
متن کاملWeighted Optimal Path in Graph with Multiple Indexes
This paper represents a technique for finding optimal paths with multiple indexes in a graph. Up to the present time, all optimal paths have been determined upon one index, say, distance for which an evaluation method exists. In this paper firstly we define multiple indexes for each edge in such a way that anyone can treat the factor for assigning an optimal path. Here, we use Data Envelopment ...
متن کاملGraph editing problems with extended regularity constraints
Graph editing problems offer an interesting perspective on suband supergraph identification problems for a large variety of target properties. They have also attracted significant attention in recent years, particularly in the area of parameterized complexity as the problems have rich parameter ecologies. In this paper we examine generalisations of the notion of editing a graph to obtain a regu...
متن کاملAttention-based Temporal Weighted Convolutional Neural Network for Action Recognition
Research in human action recognition has accelerated significantly since the introduction of powerful machine learning tools such as Convolutional Neural Networks (CNNs). However, effective and efficient methods for incorporation of temporal information into CNNs are still being actively explored in the recent literature. Motivated by the popular recurrent attention models in the research area ...
متن کاملRandom graph models of communication network topologies
We consider a variant of so called power-law random graph. A sequence of expected degrees corresponds to a power-law degree distribution with finite mean and infinite variance. In previous works the asymptotic picture with number of nodes limiting to infinity has been considered. It was found that an interesting structure appears. It has resemblance with such graphs like the Internet graph. Som...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Soft Computing
سال: 2017
ISSN: 1432-7643,1433-7479
DOI: 10.1007/s00500-017-2951-6